Complexity theory

Results: 3600



#Item
231Operations research / Approximation algorithm / Computational complexity theory / WAOA-FM / Mathematical optimization / Bin packing problem / Mathematics / Applied mathematics

ALGO 2010 ATMOS/WAOA schedule THURSDAY 9 Sept:30 - 9:00 9:00 - 9:50 10::20

Add to Reading List

Source URL: algo2010.csc.liv.ac.uk

Language: English - Date: 2010-09-01 10:39:54
232Computational complexity theory / Graph theory / Mathematics / NP-complete problems / Combinatorial optimization / Matching / Vertex cover / Gene

The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
233Analysis of algorithms / Computer science / Mathematics / Theoretical computer science / Applied mathematics / Online algorithms / Probabilistic complexity theory / Randomized algorithms / Adversary model / Algorithm / Pseudorandomness / Unique sink orientation

Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:28
234Radio resource management / Statistics / Information theory / Mathematical analysis / IEEE 802 / Mathematics / Complexity classes / Random matrices / Cooperative diversity / MIMO / NP / Wishart distribution

Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas Sun Sun Yindi Jing

Add to Reading List

Source URL: www.comm.utoronto.ca

Language: English - Date: 2013-07-09 12:30:00
235Online algorithms / Analysis of algorithms / Cache / Computer science / Applied mathematics / Mathematics / Cache algorithms / Algorithm / Competitive analysis / Computational complexity theory / Page replacement algorithm

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:34:37
236Computational complexity theory / Theory of computation / Mathematics / NP-complete problems / Set cover problem / NP / Dominating set / Approximation algorithm / Metric k-center / Optimization problem / Reduction / P versus NP problem

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Add to Reading List

Source URL: stefan.buettcher.org

Language: English - Date: 2004-09-19 21:38:52
237Computational complexity theory / Complexity classes / Theory of computation / NP / P / Reduction / Time complexity

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
238Mathematics / Computational complexity theory / Mathematical analysis / Analysis of algorithms / Operations research / Mathematical notation / Asymptotic analysis / Dynamic programming / Big O notation / Time complexity / Recurrence relation / Knapsack problem

May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-05-20 09:47:26
239Sorting algorithms / Mathematics / Order theory / Theory of computation / Radix sort / Bitonic sorter / Time complexity / Merge sort / Integer sorting / Computational complexity theory / Algorithm / Big O notation

Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:42
240Computing / Computational complexity theory / Fault-tolerant computer systems / Knowledge representation / Consensus / Distributed computing / Tree / Randomized algorithm / Computer programming

Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen Hebrew University of Jerusalem

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:04
UPDATE